Maximum minimal rankings of oriented trees
نویسندگان
چکیده
منابع مشابه
Generalized Vertex-Rankings of Partial k-trees
Md. Abul Kashem 1, Xiao Zhou 2 and Takao Nishizeki 1 1 Graduate School of Information Sciences z Education Center for Information Processing Tohoku University, Senda2 980-77, 3apan. E~aail : [email protected], [email protected] [email protected] Abst ract . A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such ...
متن کاملMinimal k-rankings for prism graphs
We determine rank numbers for the prism graph P 2 ×C n (P 2 being the connected two-node graph and C n a cycle of length n) and for the square of an even cycle.
متن کاملOn Minimal Odd Rankings for Büchi Complementation
We study minimal odd rankings (as defined by Kupferman and Vardi[KV01]) for run-DAGs of words in the complement of a nondeterministic Büchi automaton. We present an optimized version of the ranking based complementation construction of Friedgut, Kupferman and Vardi [FKV06] and Schewe’s[Sch09] variant of it, such that every accepting run of the complement automaton assigns a minimal odd ranking ...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملMINIMAL RANKINGS OF THE CARTESIAN PRODUCT Kn Km
For a graph G = (V,E), a function f : V (G) → {1, 2, . . . , k} is a kranking if f(u) = f(v) implies that every u−v path contains a vertex w such that f(w) > f(u). A k-ranking is minimal if decreasing any label violates the definition of ranking. The arank number, ψr(G), of G is the maximum value of k such that G has a minimal k-ranking. We completely determine the arank number of the Cartesian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2009
ISSN: 1944-4176
DOI: 10.2140/involve.2009.2.289